LZ77 Computation Based on the Run-Length Encoded BWT
نویسندگان
چکیده
منابع مشابه
From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back
The Lempel-Ziv factorization (LZ77) and the Run-Length encoded BurrowsWheeler Transform (RLBWT) are two important tools in text compression and indexing, being their sizes z and r closely related to the amount of text self-repetitiveness. In this paper we consider the problem of converting the two representations into each other within a working space proportional to the input and the output. L...
متن کاملA Separation Between Run-Length SLPs and LZ77
In this paper we give an infinite family of strings for which the length of the Lempel-Ziv’77 parse is a factor Ω(log n/ log log n) smaller than the smallest run-length grammar.
متن کاملTemplate-based rendering of run-length encoded volumes
Template-based volume rendering is an acceleration technique for volume ray casting. It does not trade-off the image quality for the rendering speed. However it is still fall short of interactive manipulation of volume data, mainly due to the ray-by-ray volume access pattern and the long ray path in the transparent regions. In this paper, we present an object-order template-based volume renderi...
متن کاملMatching for Run-Length Encoded Strings
1 Motivation Measuring the similarity between two strings, through such standard measures as Hamming distance, edit distance, and longest common subsequence, is one of the fundamental problems in pattern matching. We consider the problem of nding the longest common subsequence of two strings. A well-known dynamic programming algorithm computes the longest common subsequence of strings X and Y i...
متن کاملEdit distance of run-length encoded strings
Let X and Y be two run-length encoded strings, of encoded lengths k and l, respectively. We present a simple O(|X|l+|Y |k) time algorithm that computes their edit distance. 2002 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2017
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-017-0327-z